The Terwilliger algebra of an almost-bipartite P- and Q-polynomial association scheme
نویسندگان
چکیده
Let Y denote a D-class symmetric association scheme with D ≥ 3, and suppose Y is almostbipartite Pand Q-polynomial. Let x denote a vertex of Y and let T = T (x) denote the corresponding Terwilliger algebra. We prove that any irreducible T -module W is both thin and dual thin in the sense of Terwilliger. We produce two bases for W and describe the action of T on these bases. We prove that the isomorphism class of W as a T -module is determined by two parameters, the dual endpoint and diameter of W . We find a recurrence which gives the multiplicities with which the irreducible T -modules occur in the standard module. We compute this multiplicity for those irreducible T -modules which have diameter at least D − 3.
منابع مشابه
The Terwilliger Algebras of Group Association Schemes
The Terwilliger algebra of an association scheme was introduced by Paul Terwilliger [7] in order to study P-and Q-polynomial association schemes. The purpose of this paper is to discuss in detail properties of the Terwilliger algebra of the group association scheme of a finite group. We shall give bounds on the dimension of the Terwilliger algebra, and define triple regularity. Let G be a finit...
متن کاملOn Relative $t$-Designs in Polynomial Association Schemes
Motivated by the similarities between the theory of spherical t-designs and that of t-designs in Q-polynomial association schemes, we study two versions of relative t-designs, the counterparts of Euclidean t-designs for P and/or Q-polynomial association schemes. We develop the theory based on the Terwilliger algebra, which is a noncommutative associative semisimple C-algebra associated with eac...
متن کاملSymmetries of Graphs and Networks
Symmetric graphs of diameter 2 with complete normal quotients Carmen Amarra University of Western Australia, Australia [email protected] A graph has diameter 2 if it is not a complete graph and if every pair of nonadjacent vertices is joined by a path of length 2. Our general problem is to examine the overall structure of graphs which are both arc-transitive and of diameter 2 using norm...
متن کاملSome new constructions of imprimitive cometric association schemes
In a recent paper [9], the authors introduced the extended Q-bipartite double of an almost dual bipartite cometric association scheme. Since the association schemes arising from linked systems of symmetric designs are almost dual bipartite, this gives rise to a new infinite family of 4-class cometric schemes which are both Q-bipartite and Q-antipodal. These schemes, the schemes arising from lin...
متن کاملA ug 2 00 5 Almost - bipartite distance - regular graphs with the Q - polynomial property ∗
Let Γ denote a Q-polynomial distance-regular graph with diameter D ≥ 4. Assume that the intersection numbers of Γ satisfy ai = 0 for 0 ≤ i ≤ D − 1 and aD 6= 0. We show that Γ is a polygon, a folded cube, or an Odd graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 292 شماره
صفحات -
تاریخ انتشار 2005